The Behavior of Pseudo-Random Sequences
نویسندگان
چکیده
منابع مشابه
Duality of $g$-Bessel sequences and some results about RIP $g$-frames
In this paper, first we develop the duality concept for $g$-Bessel sequences and Bessel fusion sequences in Hilbert spaces. We obtain some results about dual, pseudo-dual and approximate dual of frames and fusion frames. We also expand every $g$-Bessel sequence to a frame by summing some elements. We define the restricted isometry property for $g$-frames and generalize some resu...
متن کاملOn Quasigroup Pseudo Random Sequence Generators
Abstract. Pseudo random sequence generators (PRSG) produce sequences of elements that imitate natural random behavior. They have extensive use in (1) scientific experiments as input sequences for different kinds of simulators, (2) cryptography for preparation of keys and establishing communication and (3) authentication for preparation of identification numbers, smart cards, serial numbers, etc...
متن کاملOn the Properties of Pseudo Noise Sequences with a Simple Proposal of Randomness Test
Maximal length sequences (m-sequences) are also known as pseudo random sequences or pseudo noise sequences for closely following Golomb’s popular randomness properties: (P1) balance, (P2) run, and (P3) ideal autocorrelation. Apart from these, there also exist certain other less known properties of such sequences all of which are discussed in this tutorial paper. Comprehensive proofs to each of ...
متن کاملA DHT Based Measure of Randomness
This paper presents a new discrete Hilbert transform (DHT) based measure of randomness for discrete sequences. The measure has been used to test three different classes of sequences with satisfactory results. Introduction Random numbers are used in different fields as in cryptography for generating encryption keys, in simulating and modeling complex phenomena and for selecting random samples fr...
متن کاملAvalanche in States; Combination of Sandpile and Cellular Automata for Generate Random Numbers
Cellular Automata (CA) is a self organizing structure with complex behavior which can be used in pseudo-random numbers generation(PRNG). Pure CA has a simple structure but has no ability to produce long sequences of random numbers. In order to rectify this problem, programmable CA (PCA), using stimulating factor or combination of different self organizing Criticality phenomenon can be used. In ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010